As many antipodes as vertices on some convex polyhedra
نویسندگان
چکیده
An earlier result states that a point of the surface of a convex polyhedron with n vertices, endowed with its intrinsic metric, cannot have more than n antipodes (farthest points). In this paper we produce examples of polyhedra with n vertices, on which some suitable point admits exactly n antipodes. MSC (2000): 52B10, 53C45.
منابع مشابه
As many antipodes as vertices on convex polyhedra
An earlier result states that, on the surface of a convex polyhedron with vertices endowed with its intrinsic metric, a point cannot have more than antipodes (farthest points). In this paper we produce examples of polyhedra with vertices, on which some suitable point admits exactly antipodes. We also proved that, for any positive number 1, there exist (in the closure of the set of these polyhed...
متن کاملOn the infinitesimal rigidity of weakly convex polyhedra
The main motivation here is a question: whether any polyhedron which can be subdivided into convex pieces without adding a vertex, and which has the same vertices as a convex polyhedron, is infinitesimally rigid. We prove that it is indeed the case for two classes of polyhedra: those obtained from a convex polyhedron by “denting” at most two edges at a common vertex, and suspensions with a natu...
متن کاملContributing vertices-based Minkowski sum computation of convex polyhedra
Minkowski sum is an important operation. It is used in many domains such as: computer-aided design, robotics, spatial planning, mathematical morphology, and image processing. We propose a novel algorithm, named the Contributing Verticesbased Minkowski Sum (CVMS) algorithm for the computation of the Minkowski sum of convex polyhedra. The CVMS algorithm allows to easily obtain all the facets of t...
متن کاملA Rigidity Criterion for Non-Convex Polyhedra
Let P be a (non necessarily convex) embedded polyhedron in R, with its vertices on an ellipsoid. Suppose that the interior of P can be decomposed into convex polytopes without adding any vertex. Then P is infinitesimally rigid. More generally, let P be a polyhedron bounding a domain which is the union of polytopes C1, · · · , Cn with disjoint interiors, whose vertices are the vertices of P . Su...
متن کاملFaster ASV Decomposition for Orthogonal Polyhedra, Using the Extreme Vertices Model (EVM)
The alternating sum of volumes (ASV) decomposition is a widely used technique for converting a b-rep into a CSG model, with all its implicit uses and advantages -like form feature recognition, among others. The obtained CSG tree has convex primitives at its leaf nodes, while the contents of its internal nodes alternate between the setunion and set-difference operators. This paper first shows th...
متن کامل